package leetcode.weekly.week319;

import leetcode.helper.H;
import leetcode.helper.tree.TreeArray;

public class Solution3Test extends H {

	public void debug4(Solution3 so) {
		H.compare(5, so.minimumOperations(TreeArray.array2tree(H.str2array4("[49,45,1,20,46,15,39,27,null,null,null,25]"))));
		H.compare(3, so.minimumOperations(TreeArray.array2tree(H.str2array4("[1,4,3,7,6,8,5,null,null,null,null,9,null,10]"))));
		H.compare(3, so.minimumOperations(TreeArray.array2tree(H.str2array4("[1,3,2,7,6,5,4]"))));
		H.compare(0, so.minimumOperations(TreeArray.array2tree(H.str2array4("[1,2,3,4,5,6]"))));
	}

	public void debug3(Solution3 so) {
//		H.compare(so, so);
	}

	public void debug2(Solution3 so) {
//		H.compare(so, so);
	}

	public void debug1(Solution3 so) {
//		H.compare(so, so);
	}

	public static void main(String[] args) {
		Solution3Test test = new Solution3Test();
		Solution3 so = new Solution3();
		test.debug1(so);
		test.debug2(so);
		test.debug3(so);
		test.debug4(so);
	}

}
